Admissibility in Finitely Generated Quasivarieties

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Admissibility in Finitely Generated Quasivarieties

Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore decidable. However, since free algebras may be large even for small sets of small algebras and very few generators, this naive method for checking admissibilit...

متن کامل

MULTIPLICATION MODULES THAT ARE FINITELY GENERATED

Let $R$ be a commutative ring with identity and $M$ be a unitary $R$-module. An $R$-module $M$ is called a multiplication module if for every submodule $N$ of $M$ there exists an ideal $I$ of $R$ such that $N = IM$. It is shown that over a Noetherian domain $R$ with dim$(R)leq 1$, multiplication modules are precisely cyclic or isomorphic to an invertible ideal of $R$. Moreover, we give a charac...

متن کامل

A characterization of finitely generated multiplication modules

 Let $R$ be a commutative ring with identity and $M$ be a finitely generated unital $R$-module. In this paper, first we give necessary and sufficient conditions that a finitely generated module to be a multiplication module. Moreover, we investigate some conditions which imply that the module $M$ is the direct sum of some cyclic modules and free modules. Then some properties of Fitting ideals o...

متن کامل

On Finitely Based Groups and Nonfinitely Based Quasivarieties

We define the notion of strictly finitely based varieties of groups, and determine which finite groups are strictly finitely based. Then we use this result to prove the existence of ‘very nonfinitely based’ finite algebras, thereby solving two open problems in the theory of quasivarieties.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2013

ISSN: 1860-5974

DOI: 10.2168/lmcs-9(2:9)2013